Evaluation of Sparse LU Factorization and Triangular Solution on Multicore Platforms
نویسنده
چکیده
The Chip Multiprocessor (CMP) will be the basic building block for computer systems ranging from laptops to supercomputers. New software developments at all levels are needed to fully utilize these systems. In this work, we evaluate performance of different highperformance sparse LU factorization and triangular solution algorithms on several representative multicore machines. We include both pthreads and MPI implementations in this study, and found that the pthreads implementation consistently delivers good performance and a left-looking algorithm is usually superior.
منابع مشابه
Evaluation of SuperLU on multicore architectures
The Chip Multiprocessor (CMP) will be the basic building block for computer systems ranging from laptops to supercomputers. New software developments at all levels are needed to fully utilize these systems. In this work, we evaluate performance of different highperformance sparse LU factorization and triangular solution algorithms on several representative multicore machines. We included both P...
متن کاملParallel Solution of Space Linear Systems
Many simulations in science and engineering give rise to sparse linear systems of equations. It is a well known fact that the cost of the simulation process is almost always governed by the solution of the linear systems especially for largescale problems. The emergence of extreme-scale parallel platforms, along with the increasing number of processing cores available on a single chip pose sign...
متن کاملEfficient Parallel Solutions of Large Sparse Spd Systems on Distributed-memory Multiprocessors
We consider several issues involved in the solution of sparse symmetric positive deenite systems by multifrontal method on distributed-memory multiprocessors. First, we present a new algorithm for computing the partial factorization of a frontal matrix on a subset of processors which signiicantly improves the performance of a distributed multifrontal algorithm previously designed. Second, new p...
متن کاملMultifrontal multithreaded rank-revealing sparse QR factorization
SuiteSparseQR is a sparse QR factorization package based on the multifrontal method. Within each frontal matrix, LAPACK and the multithreaded BLAS enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel’s Threading Building Blocks library. The symbolic analysis and ordering phase preeliminates singletons by per...
متن کاملOn the Relations between ILUs and Factored Approximate Inverses
This paper discusses some relationships between Incomplete LU (ILU) factoriza-tion techniques and factored sparse approximate inverse (AINV) techniques. While ILU factorizations compute approximate LU factors of the coeecient matrix A, AINV techniques aim at building triangular matrices Z and W such that W > AZ is approximately diagonal. The paper shows that certain forms of approximate inverse...
متن کامل